Browsing by Subject "distributed computing"

Now showing items 1-5 of 5

    • Average Case Analysis of a Shared Register Emulation Algorithm 
      Hu, Gerald Lee
      Distributed algorithms are important for managing systems with multiple networked components, where each component operates independently but coordinates to achieve a common goal. Previous theoretical research has produced ...
    • Bounded Protocols for Efficient Reliable Message Transmission 
      Ortiz-Lopez, Keishla Desiree (2017-07-20)
      In the reliable message transmission problem (RMTP) processors communicate by exchanging messages, but the channel that connects two processors is subject to message loss, duplication, and reordering. Previous work focused ...
    • Fairness Properties of the Trusting Failure Detector 
      Matson, Ian
      In 1985 it was shown by Fischer et al. that consensus, a fundamental problem in distributed computing, was impossible in asynchronous distributed systems in the presence of even just one process failure. This result prompted ...
    • Fault tolerant pulse synchronization 
      Deconda, Keerthi (2009-05-15)
      Pulse synchronization is the evolution of spontaneous firing action across a network of sensor nodes. In the pulse synchronization model all nodes across a network produce a pulse, or "fire", at regular intervals even ...
    • Two algorithms for leader election and network size estimation in mobile ad hoc networks 
      Neumann, Nicholas Gerard (Texas A&M University, 2005-02-17)
      We develop two algorithms for important problems in mobile ad hoc networks (MANETs). A MANET is a collection of mobile processors (“nodes”) which communicate via message passing over wireless links. Each node can communicate ...